BibSLEIGH — term rewriting tag

term rewriting

term rewriting

Tag #term rewriting

328 papers:

FSCD-2019-RubioMPV #model checking: Model Checking Strategy-Controlled Rewriting Systems (System Description) (RR, NMO, IP, AV), p. 18.
PPDP-2019-CirsteaM #encoding: Generic Encodings of Constructor Rewriting Systems (HC, PEM), p. 12.
PPDP-2019-Kikuchi0S #induction #program transformation #proving #theorem proving: Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program Transformation (KK, TA0, IS), p. 14.
FSCD-2018-AndrianariveloR #confluence: Confluence of Prefix-Constrained Rewrite Systems (NA, PR), p. 15.
FSCD-2018-Czajka #finite #infinity: Term Rewriting Characterisation of LOGSPACE for Finite and Infinite Data (LC0), p. 19.
FSCD-2018-NishidaM: Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems (NN0, YM), p. 20.
LOPSTR-2018-Payet #standard: Guided Unfoldings for Finding Loops in Standard Term Rewriting (ÉP), pp. 22–37.
IJCAR-2018-CiobacaL #approach #induction #proving #reachability: A Coinductive Approach to Proving Reachability Properties in Logically Constrained Term Rewriting Systems (SC, DL), pp. 295–311.
FSCD-2017-Akama #confluence #λ-calculus: The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type (YA), p. 19.
FSCD-2017-Bahr #graph grammar #reduction: Böhm Reduction in Infinitary Term Graph Rewriting Systems (PB), p. 20.
CADE-2017-SternagelS #confluence: Certifying Confluence of Quasi-Decreasing Strongly Deterministic Conditional Term Rewrite Systems (CS, TS), pp. 413–431.
FSCD-2016-0001PV: Reversible Term Rewriting (NN0, AP, GV), p. 18.
FSCD-2016-BrenasES #correctness #graph grammar #proving: Proving Correctness of Logically Decorated Graph Rewriting Systems (JHB, RE, MS), p. 15.
FSCD-2016-MalbosM: Homological Computations for Term Rewriting Systems (PM, SM), p. 17.
FSCD-2016-RappM #automation #first-order #linear: Automating the First-Order Theory of Rewriting for Left-Linear Right-Ground Rewrite Systems (FR, AM), p. 12.
CIAA-J-2013-OttoM15: λ-confluence for context rewriting systems (FO, FM), pp. 88–99.
RTA-2015-CirsteaLM #encoding #programmable: A faithful encoding of programmable strategies into term rewriting systems (HC, SL, PEM), pp. 74–88.
RTA-2015-ClercM: Presenting a Category Modulo a Rewriting System (FC, SM), pp. 89–105.
RTA-2015-Czajka #confluence #orthogonal: Confluence of nearly orthogonal infinitary term rewriting systems (LC), pp. 106–126.
RTA-2015-DasS #linear #logic: No complete linear term rewriting system for propositional logic (AD, LS), pp. 127–142.
RTA-2015-NageleFM #analysis #automation #confluence: Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules (JN, BF, AM), pp. 257–268.
RTA-2015-SuzukiKAT #confluence #orthogonal #revisited: Confluence of Orthogonal Nominal Rewriting Systems Revisited (TS, KK, TA, YT), pp. 301–317.
TLCA-2015-HofmannM #analysis #multi: Multivariate Amortised Resource Analysis for Term Rewrite Systems (MH, GM), pp. 241–256.
LOPSTR-2015-SatoK0T #correctness: Correctness of Context-Moving Transformations for Term Rewriting Systems (KS, KK, TA0, YT), pp. 331–345.
CADE-2015-JacquemardKS #bottom-up #constraints: Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies (FJ, YK, MS), pp. 137–151.
CADE-2015-ShintaniH #confluence #linear #named: CoLL: A Confluence Tool for Left-Linear Term Rewrite Systems (KS, NH), pp. 127–136.
CSL-2015-LiuJO #confluence: Confluence of Layered Rewrite Systems (JL, JPJ, MO), pp. 423–440.
RTA-TLCA-2014-AotoTU #confluence #diagrams #proving: Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams (TA, YT, KU), pp. 46–60.
LOPSTR-2014-LucasMG #2d #dependence #framework: Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems (SL, JM, RG), pp. 113–130.
SLE-J-2012-SloaneR #attribute grammar #domain-specific language #profiling: Domain-specific program profiling and its application to attribute grammars and term rewriting (AMS, MR), pp. 488–510.
LICS-CSL-2014-Hague: Senescent ground tree rewrite systems (MH), p. 10.
LATA-2013-JacquemardR #automaton: Rewrite Closure and CF Hedge Automata (FJ, MR), pp. 371–382.
RTA-2013-BauLNW #analysis #termination: Compression of Rewriting Systems for Termination Analysis (AB, ML, EN, JW), pp. 97–112.
RTA-2013-Okada #multi: Husserl and Hilbert on Completeness and Husserl’s Term Rewrite-based Theory of Multiplicity (MO), pp. 4–19.
ICMT-2013-MannEF #framework #graph grammar #library: The Graph Grammar Library — A Generic Framework for Chemical Graph Rewrite Systems (MM, HE, CF), pp. 52–53.
LOPSTR-2013-Vidal #erlang #towards #verification: Towards Erlang Verification by Term Rewriting (GV), pp. 109–126.
PEPM-2013-CominiT #automation #equivalence #linear #named: TRSynth: a tool for automatic inference of term equivalence in left-linear term rewriting systems (MC, LT), pp. 67–70.
ESEC-FSE-2013-BraioneDP #execution #lazy evaluation #symbolic computation: Enhancing symbolic execution with built-in term rewriting and constrained lazy initialization (PB, GD, MP), pp. 411–421.
SAC-2013-Sobieski0 #maude #sql #using: Using maude rewriting system to modularize and extend SQL (SS, BZ), pp. 853–858.
ICALP-v2-2012-FernandezR: Nominal Completion for Rewrite Systems with Binders (MF, AR), pp. 201–213.
RTA-2012-Al-HassaniMCS #problem: A Term Rewriting System for Kuratowski’s Closure-Complement Problem (OAH, QaM, CSC, VS), pp. 38–52.
RTA-2012-AndersenS: Term Rewriting Systems as Topological Dynamical Systems (SBA, JGS), pp. 53–68.
RTA-2012-Felgenhauer #confluence #polynomial: Deciding Confluence of Ground Term Rewrite Systems in Cubic Time (BF), pp. 165–175.
RTA-2012-GmeinerGS #on the: On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems (KG, BG, FS), pp. 193–208.
ICGT-2012-AotoK #confluence #decidability: Rational Term Rewriting Revisited: Decidability and Confluence (TA, JK), pp. 172–186.
LOPSTR-2012-GieslSSEF #evaluation #graph #logic programming #source code #symbolic computation: Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs (JG, TS, PSK, FE, CF), p. 1.
LOPSTR-2012-NishidaV: Computing More Specific Versions of Conditional Rewriting Systems (NN, GV), pp. 137–154.
PPDP-2012-GieslSSEF #evaluation #graph #logic programming #source code #symbolic computation: Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs (JG, TS, PSK, FE, CF), pp. 1–12.
LICS-2012-Klop #λ-calculus: Term Rewriting and λ Calculus (JWK), p. 12.
RTA-2011-AotoT #confluence #proving: A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems (TA, YT), pp. 91–106.
RTA-2011-AvanziniEM #exponential #order: A Path Order for Rewrite Systems that Compute Exponential Time Functions (MA, NE, GM), pp. 123–138.
RTA-2011-BrockschmidtOG #bytecode #composition #java #proving #recursion #source code #termination: Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting (MB, CO, JG), pp. 155–170.
RTA-2011-GrathwohlKPS #graph #named #reduction #visualisation #λ-calculus: Anagopos: A Reduction Graph Visualizer for Term Rewriting and λ Calculus (NBBG, JK, JDP, JGS), pp. 61–70.
RTA-2011-NeurauterM #matrix #proving #termination: Revisiting Matrix Interpretations for Proving Termination of Term Rewriting (FN, AM), pp. 251–266.
RTA-2011-NishidaSS: Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity (NN, MS, TS), pp. 267–282.
RTA-2011-Tison #automaton #constraints #question #similarity #what: Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What’s New? (ST), pp. 1–2.
TLCA-2011-Tison #automaton #constraints #question #similarity #what: Tree Automata, (Dis-)Equality Constraints and Term Rewriting — What’s New? (ST), pp. 3–5.
GT-VMT-2011-DuvalEP #category theory #graph transformation: Categorical Abstract Rewriting Systems and Functoriality of Graph Transformation (DD, RE, FP).
PPDP-2011-BourdierC #analysis #network #policy #security #using: Symbolic analysis of network security policies using rewrite systems (TB, HC), pp. 77–88.
FoSSaCS-2011-CaucalH #word: Regularity and Context-Freeness over Word Rewriting Systems (DC, DTH), pp. 214–228.
CADE-2011-NoschinskiEG #analysis #complexity #dependence #framework: A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems (LN, FE, JG), pp. 422–438.
ICTSS-2011-MeinkeN #testing #using: Learning-Based Testing for Reactive Systems Using Term Rewriting Technology (KM, FN), pp. 97–114.
LICS-2011-GollerL #complexity #verification: The Complexity of Verifying Ground Tree Rewrite Systems (SG, AWL), pp. 279–288.
RTA-2010-Bahr10a #partial order: Partial Order Infinitary Term Rewriting and Böhm Trees (PB), pp. 67–84.
RTA-2010-DurandSS #bound #linear #termination: Termination of linear bounded term rewriting systems (ID, GS, MS), pp. 341–356.
RTA-2010-Mimram #2d: Computing Critical Pairs in 2-Dimensional Rewriting Systems (SM), pp. 227–242.
RTA-2010-OttoBEG #analysis #automation #bytecode #java #termination: Automated Termination Analysis of Java Bytecode by Term Rewriting (CO, MB, CvE, JG), pp. 259–276.
FLOPS-2010-HaftmannN #code generation #higher-order: Code Generation via Higher-Order Rewrite Systems (FH, TN), pp. 103–117.
FLOPS-2010-KetemaS #bound #diagrams #λ-calculus: Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus (JK, JGS), pp. 272–287.
FLOPS-2010-NishidaS #injection #proving: Proving Injectivity of Functions via Program Inversion in Term Rewriting (NN, MS), pp. 288–303.
ICGT-2010-BonchiGMM #lts: Saturated LTSs for Adhesive Rewriting Systems (FB, FG, GVM, UM), pp. 123–138.
CIAA-J-2008-AlmeidaMR09 #revisited: Antimirov and Mosses’s Rewrite System Revisited (MA, NM, RR), pp. 669–684.
ICALP-v2-2009-LagoM #on the #λ-calculus: On Constructor Rewrite Systems and the λ-Calculus (UDL, SM), pp. 163–174.
RTA-2009-AotoYT #automation #confluence #proving: Proving Confluence of Term Rewriting Systems Automatically (TA, JY, YT), pp. 93–102.
RTA-2009-FuhsGPSF #integer #proving #termination: Proving Termination of Integer Term Rewriting (CF, JG, MP, PSK, SF), pp. 32–47.
RTA-2009-Simonsen: The -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity) (JGS), pp. 335–349.
GT-VMT-2009-SchimmelGS #graph grammar: Gene Expression with General Purpose Graph Rewriting Systems (JS, TG, CS), pp. 202–212.
CADE-2009-FalkeK #analysis #approach #automation #imperative #source code #termination: A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (SF, DK), pp. 277–293.
CSL-2009-EndrullisGZ: Degrees of Undecidability in Term Rewriting (JE, HG, HZ), pp. 255–270.
ICLP-2009-KoninckDS #normalisation: Demand-Driven Normalisation for ACD Term Rewriting (LDK, GJD, PJS), pp. 484–488.
LICS-2009-CreusGMT #normalisation: Non-linear Rewrite Closure and Weak Normalization (CC, GG, FM, AT), pp. 365–374.
CIAA-2008-AlmeidaMR #revisited: Antimirov and Mosses’s Rewrite System Revisited (MA, NM, RR), pp. 46–56.
LATA-2008-KorpM #bound #dependence #proving #termination: Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (MK, AM), pp. 321–332.
LATA-2008-Leupold #on the #string: On Regularity-Preservation by String-Rewriting Systems (PL), pp. 345–356.
RTA-2008-GutierrezLU: Usable Rules for Context-Sensitive Rewrite Systems (RG, SL, XU), pp. 126–141.
RTA-2008-KojimaS #decidability #linear #reachability: Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems (YK, MS), pp. 187–201.
RTA-2008-Toyama #lisp #proving #recursion #termination: Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations (YT), pp. 381–391.
ICGT-2008-Echahed #graph grammar: Inductively Sequential Term-Graph Rewrite Systems (RE), pp. 84–98.
ICLP-2008-DuckKS #implementation #named: Cadmium: An Implementation of ACD Term Rewriting (GJD, LDK, PJS), pp. 531–545.
RTA-2007-EchahedP #confluence #pointer #strict: Non Strict Confluent Rewrite Systems for Data-Structures with Pointers (RE, NP), pp. 137–152.
RTA-2007-GodoyH #decidability: Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems (GG, EH), pp. 184–199.
RTA-2007-KorpM #bound #proving #termination #using: Proving Termination of Rewrite Systems Using Bounds (MK, AM), pp. 273–287.
CADE-2007-GodoyT #normalisation #on the: On the Normalization and Unique Normalization Properties of Term Rewrite Systems (GG, ST), pp. 247–262.
SCAM-2006-WalensteinMCL #normalisation #using: Normalizing Metamorphic Malware Using Term Rewriting (AW, RM, MRC, AL), pp. 75–84.
RTA-2006-ChibaA #named #program transformation: RAPT: A Program Transformation System Based on Term Rewriting (YC, TA), pp. 267–276.
RTA-2006-GieslSST #analysis #automation #haskell #programming language #termination: Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages (JG, SS, PSK, RT), pp. 297–312.
RTA-2006-GramlichL #linear: Generalizing Newman’s Lemma for Left-Linear Rewrite Systems (BG, SL), pp. 66–80.
LOPSTR-2006-Payet #detection #using: Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator (ÉP), pp. 194–209.
LOPSTR-2006-Schneider-KampGST #analysis #automation #logic programming #source code #termination: Automated Termination Analysis for Logic Programs by Term Rewriting (PSK, JG, AS, RT), pp. 177–193.
DATE-2006-HassenT #on the #probability #verification: On the numerical verification of probabilistic rewriting systems (JBH, ST), pp. 1223–1224.
FoSSaCS-2006-BaldanCHKS #process: Processes for Adhesive Rewriting Systems (PB, AC, TH, BK, PS), pp. 202–216.
FoSSaCS-2006-JancarS #similarity: Undecidability Results for Bisimilarity on Prefix Rewrite Systems (PJ, JS), pp. 277–291.
ICLP-2006-DuckSB: ACD Term Rewriting (GJD, PJS, SB), pp. 117–131.
IJCAR-2006-EndrullisWZ #matrix #proving #termination: Matrix Interpretations for Proving Termination of Term Rewriting (JE, JW, HZ), pp. 574–588.
IJCAR-2006-KoprowskiZ #automation #infinity #order #recursion: Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems (AK, HZ), pp. 332–346.
CIAA-J-2004-GeserHWZ05 #automaton #finite #string #termination: Finding finite automata that certify termination of string rewriting systems (AG, DH, JW, HZ), pp. 471–486.
FM-2005-AlvesSVO #sql: Strategic Term Rewriting and Its Application to a VDMSL to SQL Conversion (TLA, PFS, JV, JNO), pp. 399–414.
RTA-2005-AotoY #dependence: Dependency Pairs for Simply Typed Term Rewriting (TA, TY), pp. 120–134.
RTA-2005-BouajjaniT #on the #process #reachability #set: On Computing Reachability Sets of Process Rewrite Systems (AB, TT), pp. 484–499.
RTA-2005-EscobarMT: Natural Narrowing for General Term Rewriting Systems (SE, JM, PT), pp. 279–293.
RTA-2005-GeserHWZ #automaton #linear #on the #termination: On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems (AG, DH, JW, HZ), pp. 353–367.
RTA-2005-NishidaSS: Partial Inversion of Constructor Term Rewriting Systems (NN, MS, TS), pp. 264–278.
RTA-2005-Toyama #confluence: Confluent Term Rewriting Systems (YT), p. 1.
PPDP-2005-ChibaAT #program transformation: Program transformation by templates based on term rewriting (YC, TA, YT), pp. 59–69.
FoSSaCS-2005-Kaiser #confluence #decidability: Confluence of Right Ground Term Rewriting Systems Is Decidable (LK), pp. 470–489.
CADE-2005-GodoyT #linear #termination: Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules (GG, AT), pp. 164–176.
CSL-2005-GodoyT #confluence #linear: Confluence of Shallow Right-Linear Rewrite Systems (GG, AT), pp. 541–556.
VMCAI-2005-Bozzelli #model checking #process: Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties (LB), pp. 282–297.
CSMR-2004-Latendresse #evaluation #preprocessor #symbolic computation: Rewrite Systems for Symbolic Evaluation of C-like Preprocessing (ML), pp. 165–173.
RTA-2004-Blanqui #higher-order #termination #type system: A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems (FB), pp. 24–39.
RTA-2004-Ketema: Böhm-Like Trees for Term Rewriting Systems (JK), pp. 233–248.
RTA-2004-LimetS #logic programming #proving #source code: Proving Properties of Term Rewrite Systems via Logic Programs (SL, GS), pp. 170–184.
RTA-2004-MatthewsFFF #visual notation: A Visual Environment for Developing Context-Sensitive Term Rewriting Systems (JM, RBF, MF, MF), pp. 301–311.
RTA-2004-Simonsen #composition #confluence #on the: On the Modularity of Confluence in Infinitary Term Rewriting (JGS), pp. 185–199.
RTA-2004-Takai #abstract interpretation #using #verification: A Verification Technique Using Term Rewriting Systems and Abstract Interpretation (TT), pp. 119–133.
RTA-2004-Toyama #higher-order #lisp #termination: Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms (YT), pp. 40–54.
LOPSTR-2004-EscobarMT: Natural Rewriting for General Term Rewriting Systems (SE, JM, PT), pp. 101–116.
PPDP-2004-FernandezGM: Nominal rewriting systems (MF, MG, IM), pp. 108–119.
FoSSaCS-2004-Meyer #on the: On Term Rewriting Systems Having a Rational Derivation (AM), pp. 378–392.
IJCAR-2004-GodoyT: Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure (GG, AT), pp. 91–106.
DLT-2003-HofbauerW #string: Deleting String Rewriting Systems Preserve Regularity (DH, JW), pp. 337–348.
RTA-2003-AotoY #termination: Termination of Simply Typed Term Rewriting by Translation and Labelling (TA, TY), pp. 380–394.
RTA-2003-BrandMV #exclamation #for free: Environments for Term Rewriting Engines for Free! (MvdB, PEM, JJV), pp. 424–435.
RTA-2003-KhasidashviliG #partial order #semantics: Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication) (ZK, JRWG), pp. 467–482.
RTA-2003-ThiemannG #termination: Size-Change Termination for Term Rewriting (RT, JG), pp. 264–278.
PPDP-2003-Hamana #algebra #approach: Term rewriting with variable binding: an initial algebra approach (MH), pp. 148–159.
LDTA-2003-BrandKMV #ambiguity #generalised parsing #parsing #semantics: Generalized Parsing and Term Rewriting: Semantics Driven Disambiguation (MvdB, SK, LM, JJV), pp. 575–591.
RTA-2002-Durand #named: Autowrite: A Tool for Checking Properties of Term Rewriting Systems (ID), pp. 371–375.
RTA-2002-SekiTFK: Layered Transducing Term Rewriting System and Its Recognizability Preserving Property (HS, TT, YF, YK), pp. 98–113.
RTA-2002-Tahhan-Bittar #bound #confluence #recursion: Recursive Derivational Length Bounds for Confluent Term Rewrite Systems (ETB), pp. 281–295.
FLOPS-2002-KasuyaSA #higher-order #normalisation: Descendants and Head Normalization of Higher-Order Rewrite Systems (HK, MS, KA), pp. 198–211.
WRLA-2002-DenkerM #communication #modelling #multi #protocol #using: Modeling Group Communication Protocols Using Multiset Term Rewriting (GD, JKM), pp. 20–39.
LICS-2002-Tiwari #confluence #polynomial: Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time (AT), p. 447–?.
CIAA-2001-NedjahM #adaptation #automaton #pattern matching #performance: Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting (NN, LdMM), pp. 221–233.
ICALP-2001-Bouajjani #infinity #verification: Languages, Rewriting Systems, and Verification of Infinite-State Systems (AB), pp. 24–39.
RTA-2001-Lucas #semantics: Transfinite Rewriting Semantics for Term Rewriting Systems (SL), pp. 216–230.
RTA-2001-OyamaguchiO #confluence #problem #unification: The Unification Problem for Confluent Right-Ground Term Rewriting Systems (MO, YO), pp. 246–260.
RTA-2001-Yamada #confluence #termination: Confluence and Termination of Simply Typed Term Rewriting Systems (TY), pp. 338–352.
IJCAR-2001-Urbain #automation #incremental #proving #termination: Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems (XU), pp. 485–498.
WLC-2000-Steinby #automaton #formal method: Tree Automata in the Theory of Term Rewriting (MS), pp. 434–449.
RTA-2000-Blanqui #confluence #higher-order #termination: Termination and Confluence of Higher-Order Rewrite Systems (FB), pp. 47–61.
RTA-2000-Stuber #calculus #convergence: Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems (JS), pp. 229–245.
RTA-2000-TakaiKS #effectiveness #finite #linear: Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability (TT, YK, HS), pp. 246–260.
RTA-2000-Tison #automaton: Tree Automata and Term Rewrite Systems (ST), pp. 27–30.
PPDP-2000-Gramlich #preprocessor #proving #termination: Simplifying termination proofs for rewrite systems by preprocessing (BG), pp. 139–150.
FoSSaCS-2000-Caucal #on the #word: On Word Rewriting Systems Having a Rational Derivation (DC), pp. 48–62.
WRLA-2000-Millen #analysis #encryption #overview #protocol: Applications of Term Rewriting to Cryptographic Protocol Analysis overview of the invited talk (JKM), pp. 229–234.
RTA-1999-BachmairRRT #normalisation: Normalization via Rewrite Closures (LB, CRR, IVR, AT), pp. 190–204.
RTA-1999-FrougnyS #polynomial: A Rewrite System Associated with Quadratic Pisot Units (CF, JS), pp. 356–370.
RTA-1999-GieslM: Transforming Context-Sensitive Rewrite Systems (JG, AM), pp. 271–287.
RTA-1999-NagayaT #decidability: Decidability for Left-Linaer Growing Term Rewriting Systems (TN, YT), pp. 256–270.
FLOPS-1999-Ohlebusch #on the: On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems (EO), pp. 179–193.
AGTIVE-1999-Munch #graph grammar: PROgrammed Graph REwriting System PROGRES (MM), pp. 441–448.
AGTIVE-1999-ZamperoniE #aspect-oriented #exclamation #experience #graph grammar #integration #re-engineering #using: Formal Integration of Software Engineering Aspects Using Graph Rewrite Systems — A Typical Experience?! (AZ, GE), pp. 359–367.
SAC-1999-OgataIF #optimisation #using: Optimizing Term Rewriting Using Discrimination Nets With Specialization (KO, SI, KF), pp. 511–518.
FASE-1999-FokkinkV #legacy: Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories (WF, CV), pp. 98–113.
CSL-1999-Middeldorp: Term Rewriting (AM), p. 577.
ICALP-1998-Touzet: A Complex Example of a Simplifying Rewrite System (HT), pp. 507–517.
RTA-1998-Klop: Origin Tracking in Term Rewriting (JWK), p. 1.
RTA-1998-LimetR #equation: Solving Disequations Modulo Some Class of Rewrite Systems (SL, PR), pp. 121–135.
TAGT-1998-BottoniPS: From Formulae to Rewriting Systems (PB, FPP, MS), pp. 267–280.
TAGT-1998-SchurrW #graph grammar #uml: UML Packages for PROgrammed Graph REwriting Systems (AS, AJW), pp. 396–409.
ALP-PLILP-1998-Aoto #persistent #problem: Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems (TA), pp. 250–265.
FoSSaCS-1998-CorradiniG: Rational Term Rewriting (AC, FG), pp. 156–171.
WRLA-1998-BrandKV: Term rewriting for sale (MvdB, PK, CV), pp. 218–241.
WRLA-1998-Eker #evaluation: Term rewriting with operator evaluation strategies (SE), pp. 311–330.
CADE-1998-BoudetC #confluence #equation: About the Confluence of Equational Pattern Rewrite Systems (AB, EC), pp. 88–102.
CSL-1998-BonfanteCMT #complexity #polynomial: Complexity Classes and Rewrite Systems with Polynomial Interpretation (GB, AC, JYM, HT), pp. 372–384.
ICALP-1997-NarendranO #confluence #decidability #finite #problem #string #word: The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent (PN, FO), pp. 638–648.
FME-1997-CazierD #2d #set: Term Rewrite Systems to Derive Set Boolean Operations on 2D Objects (DC, JFD), pp. 605–623.
RTA-1997-ContejeanMR: Rewrite Systems for Natural, Integral, and Rational Arithmetic (EC, CM, LR), pp. 98–112.
RTA-1997-KapurS #order #proving #termination: A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems (DK, GS), pp. 142–156.
RTA-1997-OgataOF #automaton #named #order: TRAM: An Abstract Machine for Order-Sorted Conditioned Term Rewriting Systems (KO, KO, KF), pp. 335–338.
RTA-1997-Otto #on the #string: On the Property of Preserving Regularity for String-Rewriting Systems (FO), pp. 83–97.
RTA-1997-OyamaguchiO #linear #parallel: A New Parallel Closed Condition for Church-Rossser of Left-Linear Term Rewriting Systems (MO, YO), pp. 187–201.
ALP-1997-AotoT #composition #on the: On Composable Properties of Term Rewriting Systems (TA, YT), pp. 114–128.
PLILP-1997-OgataF #evaluation #implementation: Implementation of Term Rewritings with the Evaluation Strategy (KO, KF), pp. 225–239.
TAPSOFT-1997-YamadaALM: Logicality of Conditional Rewrite Systems (TY, JA, CLS, AM), pp. 141–152.
CADE-1997-DurandM #call-by #decidability: Decidable Call by Need Computations in term Rewriting (ID, AM), pp. 4–18.
ICLP-1997-Raamsdonk #logic programming #source code: Translating Logic Programs into Conditional Rewriting Systems (FvR), pp. 168–182.
RTA-1996-GramlichW #confluence #revisited: Confluence of Terminating Conditional Rewrite Systems Revisited (BG, CPW), pp. 245–259.
RTA-1996-Jacquemard #approximate #decidability: Decidable Approximations of Term Rewriting Systems (FJ), pp. 362–376.
RTA-1996-Luth #algebra #composition #proving #theorem: Compositional Term Rewriting: An Algebraic Proof of Toyama’s Theorem (CL), pp. 261–275.
RTA-1996-SakaiT #semantics: Semantics and Strong Sequentiality of Priority Term Rewriting Systems (MS, YT), pp. 377–391.
RTA-1996-Vittek #compilation #nondeterminism: A Compiler for Nondeterministic Term Rewriting Systems (MV), pp. 154–167.
ALP-1996-KennawayOV: Meaningless Terms in Rewriting (RK, VvO, FJdV), pp. 254–268.
ALP-1996-ManoO #higher-order #normalisation: Unique Normal Form Property of Higher-Order Rewriting Systems (KM, MO), pp. 269–283.
PLILP-1996-FernandezM #interactive: From Term Rewriting to Generalised Interaction Nets (MF, IM), pp. 319–333.
CC-1996-Assmann #graph grammar #how #program analysis #program transformation: How to Uniformly Specify Program Analysis and Transformation with Graph Rewrite Systems (UA), pp. 121–135.
ESOP-1996-BakelBF #abstraction #normalisation: Rewrite Systems with Abstraction and β-Rule: Types, Approximants and Normalization (SvB, FB, MF), pp. 387–403.
CSL-1996-GeserMOZ: Relative Undecidability in Term Rewriting (AG, AM, EO, HZ), pp. 150–166.
RTA-1995-BakelF #normalisation #type system: (Head-) Normalization of Typeable Rewrite Systems (SvB, MF), pp. 279–293.
RTA-1995-CorradiniGM #modelling: Relating Two Categorial Models of Term Rewriting (AC, FG, UM), pp. 225–240.
RTA-1995-LysneP #higher-order #termination: A Termination Ordering for Higher Order Rewrite System (OL, JP), pp. 26–40.
RTA-1995-Nipkow #higher-order: Higher-Order Rewrite Systems (TN), p. 256.
RTA-1995-Stickel #proving #theorem proving: Term Rewriting in Contemporary Resolution Theorem Proving (MES), p. 101.
RTA-1995-SuzukiMI: Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides (TS, AM, TI), pp. 179–193.
RTA-1995-WaltersZ #integer: Rewrite Systems for Integer Arithmetic (HRW, HZ), pp. 324–338.
TLCA-1995-Leclerc #coq #development #multi #order #proving #termination: Termination Proof of Term Rewriting System with the Multiset Path Ordering. A Complete Development in the System Coq (FL), pp. 312–327.
TAPSOFT-1995-Rao: Semi-Completeness of Hierarchical and Super-Hierarchical Combinations of Term Rewriting Systems (MRKKR), pp. 379–393.
TAPSOFT-1995-SampaioHPUFA #named #programming #proving: PLATO: A Tool to Assist Programming as Term Rewriting and Therem Proving (AJS, AMH, CTP, CDU, MFF, NCA), pp. 797–798.
ILPS-1995-DidierE #abstraction: Abstraction of Conditional Term Rewriting Systems (DB, RE), pp. 162–176.
ICALP-1994-CosmoK #algebra #first-order #recursion #λ-calculus: Combining First Order Algebraic Rewriting Systems, Recursion and Extensional λ Calculi (RDC, DK), pp. 462–472.
TAGT-1994-Assmann #on the #program analysis: On Edge Addition Rewrite Systems and their Relevance to Program Analysis (UA), pp. 321–335.
ALP-1994-Gramlich #composition #confluence #on the #termination: On Modularity of Termination and Confluence Properties of Conditional Rewrite Systems (BG), pp. 186–203.
ALP-1994-Marchiori #logic programming #source code: Logic Programs as term Rewriting Systems (MM), pp. 223–241.
PLILP-1994-FieldT #dependence #slicing: Dynamic Dependence in Term rewriting Systems and its Application to Program Slicing (JF, FT), pp. 415–431.
SAC-1994-KucherovR #on the #problem #word: On ground reducibility problem for word rewriting systems with variables (GK, MR), pp. 271–276.
ESOP-1994-Buth #simulation: Simulation of SOS Definitions with Term Rewriting Systems (KHB), pp. 150–164.
ICALP-1993-BarbaneraF #composition #confluence #termination: Modularity of Termination and Confluence in Combinations of Rewrite Systems with λω (FB, MF), pp. 657–668.
RTA-1993-Ariola #graph #modelling: Relating Graph and Term Rewriting via Böhm Models (ZMA), pp. 183–197.
RTA-1993-FerreiraZ #termination: Total Termination of Term Rewriting (MCFF, HZ), pp. 213–227.
RTA-1993-Field #approach #graph #incremental #reduction: A Graph Reduction Approach to Incremental Term Rewriting (JF), pp. 259–273.
RTA-1993-Khasidashvili #normalisation #orthogonal: Optimal Normalization in Orthogonal Term Rewriting Systems (ZK), pp. 243–258.
RTA-1993-LevyA #order: Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations (JL, JAC), pp. 17–31.
TLCA-1993-Bakel: Partial Intersection Type Assignment in Applicative Term Rewriting Systems (SvB), pp. 29–44.
TLCA-1993-BarbaneraF #higher-order: Combining First and Higher Order Rewrite Systems with Type Assignment Systems (FB, MF), pp. 60–74.
TLCA-1993-Nipkow #confluence #higher-order #orthogonal: Orthogonal Higher-Order Rewrite Systems are Confluent (TN), pp. 306–317.
TAPSOFT-1993-Corradini: Term Rewriting in CT-Sigma (AC), pp. 468–484.
ILPS-1993-AguzziM #logic programming #source code #termination: Termination of Logic Programs via Equivalent Rewrite Systems (GA, UM), p. 634.
ICALP-1992-Bundgen #algorithm #perspective: Buchberger’s Algorithm: The Term Rewriter’s Point of View (RB), pp. 380–391.
ICALP-1992-Comon #constraints: Completion of Rewrite Systems with Membership Constraints (HC), pp. 392–403.
SEKE-1992-Huai #knowledge base: A Knowledge Base Management System on Relation Model and Term Rewriting (JH), pp. 102–108.
ALP-1992-Hoffmann: Term Rewriting with Sharing and Memoïzation (BH), pp. 128–142.
ALP-1992-Lescanne #termination: Termination of Rewrite Systems by Elementary Interpretations (PL), pp. 21–36.
CADE-1992-Kesner #order #orthogonal: Free Sequentially in Orthogonal Order-Sorted Rewriting Systems with Constructors (DK), pp. 603–617.
CADE-1992-YelickG #parallel: A Parallel Completion Procedure for Term Rewriting Systems (KAY, SJG), pp. 109–123.
LICS-1992-Caucal #monad: Monadic Theory of Term Rewritings (DC), pp. 266–273.
LICS-1992-Toyama #linear: Strong Sequentiality of Left-Linear Overlapping Term Rewriting Systems (YT), pp. 274–284.
ICALP-1991-MadlenerNO #monad #string: A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups (KM, PN, FO), pp. 279–290.
RTA-1991-Billaud #animation #graph grammar #interactive #named: ANIGRAF: An Interactive System for the Animation of Graph Rewriting Systems with Priorities (MB), pp. 437–438.
RTA-1991-CohenW #performance #representation: An Efficient Representation of Arithmetic for Term Rewriting (DC, PW), pp. 240–251.
RTA-1991-CoquideDGV #automaton #bottom-up: Bottom-Up Tree Pushdown Automata and Rewrite Systems (JLC, MD, RG, SV), pp. 287–298.
RTA-1991-Hofbauer #bound #proving #termination: Time Bounded Rewrite Systems and Termination Proofs by Generalized Embedding (DH), pp. 62–73.
RTA-1991-KennawayKSV #orthogonal #reduction: Transfinite Reductions in Orthogonal Term Rewriting Systems (RK, JWK, MRS, FJdV), pp. 1–12.
RTA-1991-Kucherov #on the: On Relationship Between Term Rewriting Systems and Regular Tree Languages (GK), pp. 299–311.
RTA-1991-RameshR #incremental #normalisation #performance: Incremental Techniques for Efficient Normalization of Nonlinear Rewrite Systems (RR, IVR), pp. 335–347.
RTA-1991-Salomaa #confluence #decidability #monad #termination: Decidability of Confluence and Termination of Monadic Term Rewriting Systems (KS), pp. 275–286.
RTA-1991-Socher-Ambrosius #algebra #convergence: Boolean Algebra Admits No Convergent Term Rewriting System (RSA), pp. 264–274.
POPL-1991-Maranget #orthogonal #λ-calculus: Optimal Derivations in Weak λ-calculi and in Orthogonal Terms Rewriting Systems (LM), pp. 255–269.
CAAP-1991-Caron #automaton #bound #linear: Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations on Decision Properties (ACC), pp. 74–89.
CAV-1991-Mutz #behaviour #correctness #proving #using: Using the HOL Prove Assistant for proving the Correctness of term Rewriting Rules reducing Terms of Sequential Behavior (MM), pp. 277–287.
CSL-1991-Weiermann #proving #termination: Proving Termination for Term Rewriting Systems (AW), pp. 419–428.
IWPTS-1991-CavalliK #consistency #generative #graph grammar #protocol #testing #using: Protocol Conformance Test Generation Using a Graph Rewriting System (ARC, SUK), pp. 285–288.
ICALP-1990-Klop: Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond (JWK), pp. 350–369.
ICALP-1990-VermaR #algorithm #normalisation: Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems (RMV, IVR), pp. 370–385.
GG-1990-Plump: Graph-Reducible Term Rewriting Systems (DP), pp. 622–636.
GG-1990-Schurr90a #editing #graph grammar #hybrid: Presentation of the PROGRESS-Editor: A text-oriented hybrid editor for PROgrammed Graph REwriting SyStems (AS), p. 67.
ALP-1990-Bundgen #finite: Applying Term Rewriting Methods to Finite Groups (RB), pp. 332–346.
ALP-1990-Steinbach: AC-Termination of Rewrite Systems: A Modified Knuth-Bendix Ordering (JS), pp. 372–386.
CC-1990-DesplandMR #generative #named #using: PAGODE: A Back End Generator Using Attribute Abstract Syntaxes and Term Rewritings (AD, MM, RR), pp. 86–105.
ESOP-1990-Kennaway #ambiguity #lazy evaluation #pattern matching: The Specificity Rule for Lazy Pattern-Matching in Ambiguous Term Rewrite Systems (RK), pp. 256–270.
CADE-1990-Baader: Rewrite Systems for Varieties of Semigroups (FB), pp. 396–410.
CADE-1990-Reddy #induction: Term Rewriting Induction (USR), pp. 162–177.
LICS-1990-DauchetT #decidability #formal method: The Theory of Ground Rewrite Systems is Decidable (MD, ST), pp. 242–248.
RTA-1989-AnantharamanHM #named: SbReve2: A Term Rewriting Laboratory with (AC-) Unfailing Completion (SA, JH, JM), pp. 533–537.
RTA-1989-AvenhausMS #named: COMTES — An Experimental Environment for the Completion of Term Rewriting Systems (JA, KM, JS), pp. 542–546.
RTA-1989-Birkhoff #algebra #perspective: Term Rewriting and Universal Algebra in Historical Perspective (GB), p. 1.
RTA-1989-DauchetD #compilation: Compilation of Ground Term Rewriting Systems and Applications (MD, AD), pp. 556–558.
RTA-1989-LatchS #termination: A Local Termination Property for Term Rewriting Systems (DML, RS), pp. 222–233.
RTA-1989-Middeldorp #aspect-oriented #composition #normalisation: Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms (AM), pp. 263–277.
RTA-1989-NaoiI #algebra #complexity #semantics: Algebraic Semantics and Complexity of Term Rewriting Systems (TN, YI), pp. 311–325.
RTA-1989-Otto #canonical #congruence #finite #strict #string: Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems (FO), pp. 359–370.
RTA-1989-SekarPR #execution #parallel #performance: Transforming Strongly Sequential Rewrite Systems with Constructors for Efficient parallel Execution (RCS, SP, IVR), pp. 404–418.
RTA-1989-ToyamaKB #linear #termination: Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft- (YT, JWK, HPB), pp. 477–491.
CCIPL-1989-Bondorf #self: A Self-Applicable Partial Evaluator for Term Rewriting Systems (AB), pp. 81–95.
LICS-1989-Middeldorp #termination: A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems (AM), pp. 396–401.
VDME-1988-ButhB #code generation #correctness #proving #specification #using: Correctness Proofs for Meta IV Written Code Generator Specification using Term Rewriting (BB, KHB), pp. 406–433.
ALP-1988-Bousdira: A Completion Procedure for Hierarchical Conditional Rewriting Systems (WB), pp. 93–107.
ALP-1988-FulopV #automaton #linear #set: A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata (ZF, SV), p. 157.
ALP-1988-HofbauerK #induction #proving #theorem: Proving Inductive Theorems Based on Term Rewriting Systems (DH, RDK), pp. 180–190.
ALP-1988-HoffmannP #evaluation #performance: Jungle Evaluation for Efficient Term Rewriting (BH, DP), pp. 191–203.
ALP-1988-Hussmann #algebra #nondeterminism #specification: Nondeterministic Algebraic Specifications and Nonconfluent Term Rewriting (HH), pp. 31–40.
CADE-1988-DershowitzOS #canonical: Canonical Conditional Rewrite Systems (ND, MO, GS), pp. 538–549.
CADE-1988-GallierNPRS #canonical #equation #finite #polynomial #set: Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time (JHG, PN, DAP, SR, WS), pp. 182–196.
CADE-1988-PotterP: Term Rewriting: Some Experimental Results (RCP, DAP), pp. 435–453.
LICS-1988-DershowitzO: Proof-Theoretic Techniques for Term Rewriting Theory (ND, MO), pp. 104–111.
LICS-1988-Vorobyov #on the: On the Arithmetic Inexpressiveness of Term Rewriting Systems (SGV), pp. 212–217.
RTA-1987-BaetenBK: Term Rewriting Systems with Priorities (JCMB, JAB, JWK), pp. 83–94.
RTA-1987-Benois #algorithm #automaton #complexity #regular expression: Descendants of Regular Language in a Class of Rewriting Systems: Algorithm and Complexity of an Automata Construction (MB), pp. 121–132.
RTA-1987-ChoppyKS #algorithm #complexity: Algorithmic Complexity of Term Rewriting Systems (CC, SK, MS), pp. 256–273.
RTA-1987-DauchetC #linear: A Gap Between Linear and Non Linear Term-Rewriting Systems (1) (MD, FDC), pp. 95–104.
RTA-1987-DesplandMR #code generation #generative: Code Generator Generation Based on Template-Driven Target Term Rewriting (AD, MM, RR), pp. 105–120.
RTA-1987-Kaplan #compilation: A Compiler for Conditional Term Rewriting Systems (SK), pp. 25–41.
RTA-1987-MadlenerO #finite #string: Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems (KM, FO), pp. 133–144.
RTA-1987-SquierO #canonical #finite #monad #problem #word: Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems (CCS, FO), pp. 74–82.
DAC-1987-ChandrasekharPC #design #hardware #verification: Application of Term Rewriting Techniques to Hardware Design Verification (MSC, JPP, KWC), pp. 277–282.
CSL-1987-Schmitt #overview: A Survey of Rewrite Systems (PHS), pp. 235–262.
LICS-1987-DauchetTHL #confluence #decidability: Decidability of the Confluence of Ground Term Rewriting Systems (MD, ST, TH, PL), pp. 353–359.
ICALP-1986-YouS #algorithm #confluence: E-Unification Algorithms for a Class of Confluent Term Rewriting Systems (JHY, PAS), pp. 454–463.
GG-1986-Courcelle #algebra #graph #graph grammar #representation: A representation of graphs by algebraic expressions and its use for graph rewriting systems (BC), pp. 112–132.
ESOP-1986-GeserH #case study #experience #interpreter #specification: Experiences with the RAP System — A Specification Interpreter Combining Term Rewriting and Resolution (AG, HH), pp. 339–350.
CADE-1986-AvenhausBGM #algebra #named #specification: TRSPEC: A Term Rewriting Based System for Algebraic Specifications (JA, BB, RG, KM), pp. 665–667.
CADE-1986-CherifaL #implementation #polynomial #termination: An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial Interpretations (ABC, PL), pp. 42–51.
CADE-1986-Comon #anti: Sufficient Completeness, Term Rewriting Systems and “Anti-Unification” (HC), pp. 128–140.
CADE-1986-GnaedigL #commutative #proving #termination: Proving Termination of Associative Commutative Rewriting Systems by Rewriting (IG, PL), pp. 52–61.
CADE-1986-PoratF #equation: Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems (SP, NF), pp. 21–41.
CADE-1986-Toyama #equivalence #how #induction: How to Prove Equivalence of Term Rewriting Systems without Induction (YT), pp. 118–127.
RTA-1985-Book: Thue Systems as Rewriting Systems (RVB), pp. 63–94.
RTA-1985-ChoppyJ #named #petri net #proving: PETRIREVE: Proving Petri Net Properties with Rewriting Systems (CC, CJ), pp. 271–286.
RTA-1985-Hsiang #proving #theorem proving: Two Results in Term Rewriting Theorem Proving (JH), pp. 301–324.
RTA-1985-PoratF: Fairness in Term Rewriting Systems (SP, NF), pp. 287–300.
CAAP-1985-KapurNS #order #proving #termination: A Path Ordering for Proving Termination of Term Rewriting Systems (DK, PN, GS), pp. 173–187.
LFP-1984-Bellegarde #sequence: Rewriting Systems on FP Expressions that Reduce the Number of Sequences They Yield (FB), pp. 63–73.
CADE-1984-Lescanne #algebra: Term Rewriting Systems and Algebra (PL), pp. 166–174.
POPL-1983-Lescanne #generative: Computer Experiments with the Reve Term Rewriting System Generator (PL), pp. 99–108.
ICALP-1982-GuttagKM #tool support: Derived Pairs, Overlap Closures, and Rewrite Dominoes: New Tools for Analyzing Term rewriting Systems (JVG, DK, DRM), pp. 300–312.
GG-1982-Nagl #graph grammar #overview: Bibliography on graph-rewriting systems (graph grammars) (MN), pp. 415–448.
CADE-1982-Book #power of #string: The Power of the Church-Rosser Property for String Rewriting Systems (RVB), pp. 360–368.
ICALP-1981-Dershowitz #linear #termination: Termination of Linear Rewriting Systems (ND), pp. 448–458.
ICALP-1981-Pettorossi #order #proving #recursion #termination: Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems (AP), pp. 432–447.
STOC-1981-Chew #normalisation: Unique Normal Forms in Term Rewriting Systems with Repeated Variables (PC), pp. 7–18.
CADE-1980-Jeanrond #algebra #termination: Deciding Unique Termination of Permutative Rewriting Systems: Choose Your Term Algebra Carefully (HJJ), pp. 335–355.
ICALP-1979-Chottin #strict: Strict Deterministic Languages and Controlled Rewriting Systems (LC), pp. 104–117.
GG-1978-BatiniD #database #design #relational: Rewriting Systems as a Tool for Relational Data Base Design (CB, AD), pp. 139–154.
ICALP-1974-CulikM #parallel: Parallel Rewriting Systems on terms (KCI, TSEM), pp. 495–510.
ICALP-1974-EhrenfeuchtR #morphism #trade-off #using: Trade-off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems (AE, GR), pp. 473–480.
ICALP-1974-Salomaa #parallel: Parallelism in Rewriting Systems (AS), pp. 523–533.